Comparision of Routing Algorithms Implemented for Streaming Applications in Wireless Sensor Networks

Wireless sensor network applications require tiny sized sensors with short transmission communication or signaling range which reduce the chances of detection. These size constraints cause limitations on CPU speed, amount of memory, RF bandwidth and battery lifetime. And therefore, efficient communication techniques are essential for increasing the lifetime and quality of data collection and decreasing the communication latency of such wireless devices. In this paper, the performance of a Quality of serviced based routing scheme (QUES) is compared with other existing algorithms and it is proved that QUES algorithm performs better than other existing routing algorithms namely SPIN, PEGASIS and WEED by transmitting different types of movie for experiment. The test results show that QUES algorithm performs better related to the parameters bandwidth, delay, error rate, and percentage of data loss, Connection establishment time and the number of hops used in the communication path.